Some Separation Results Between Classes of Pointer Algorithms
نویسندگان
چکیده
We investigate the relative computational power of three classes of pointer algorithms by comparing time and space usage. These classes include two from Tarjan’s original paper and another class which we introduce which is related to another long standing problem.
منابع مشابه
Explanation by refinement and linearisability of two non-blocking shared-variable communication algorithms
Simpson and Harris have described multi-slot algorithms implementing a single-place buffer, each operating without explicit hardware synchronisation mechanisms. Conventional refinement and proof techniques have explained that these algorithms work, but not how they work. An unconventional refinement process starting from the classic single-variable buffer, using both data and atomicity refineme...
متن کاملBeyond Reachability: Shape Abstraction in the Presence of Pointer Arithmetic
Previous shape analysis algorithms use a memory model where the heap is composed of discrete nodes that can be accessed only via access paths built from variables and field names, an assumption that is violated by pointer arithmetic. In this paper we show how this assumption can be removed, and pointer arithmetic embraced, by using an analysis based on separation logic. We describe an abstract ...
متن کاملData Independence of Read, Write, and Control Structures in PRAM Computations
under the title \Data-independences of parallel random access machines." Abstract We introduce the notions of control and communication structures in PRAM computations and relate them to the concept of data-independence. Our main result is to characterize diierences between unbounded fan-in parallelism AC k , bounded fan-in par-allelism NC k , and the sequential classes DSPACE(log n) and LOGDCF...
متن کاملReasoning About Sequences of Memory States
Motivated by the verification of programs with pointer variables, we introduce a temporal logic LTL whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We analyze the complexity of various model-checking and satisfiability problems for LTL, considering various fragments of...
متن کاملReasoning about sequences of memory states ( preliminary version ) ?
In order to verify programs with pointer variables, we introduce a temporal logic LTL whose underlying assertion language is the quantifier-free fragment of separation logic and the temporal logic on the top of it is the standard linear-time temporal logic LTL. We state the complexity of various model-checking and satisfiability problems for LTL, considering various fragments of separation logi...
متن کامل